A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
نویسنده
چکیده
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method. No bound on the complexity of the values of f is needed to be known a priori. The number of oracle calls is bounded by a polynomial in the size of the underlying set.
منابع مشابه
Xxa Strongly Polynomial - Time Algorithm for Minimizingsubmodular
This paper presents a combinatorial polynomial-time algorithm for minimizing submod-ular set functions. The algorithm employs a scaling scheme that uses a ow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the largest length of the functio...
متن کاملA simple combinatorial algorithm for submodular function minimization
This paper presents a new simple algorithm for minimizing submodular functions. For integer valued submodular functions, the algorithm runs in O(nEO log nM) time, where n is the cardinality of the ground set, M is the maximum absolute value of the function value, and EO is the time for function evaluation. The algorithm can be improved to run in O((nEO+n) log nM) time. The strongly polynomial v...
متن کاملA Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n EO + n) time, where EO is the time to evaluate f(S) for some S ⊆ V. This improves the previous best strongly polynomial running time by more than a factor of n
متن کاملMinimizing Submodular Functions on Diamonds via Generalized Fractional Matroid Matchings
In this paper we show the rst polynomial-time algorithm for the problem of minimizing submodular functions on the product of diamonds of nite size. This submodular function minimization problem is reduced to the membership problem for an associated polyhedron, which is equivalent to the optimization problem over the polyhedron, based on the ellipsoid method. The latter optimization problem is a...
متن کاملSubmodular function minimization
A set function f defined on the subsets of a finite set V is said to be submodular if it satisfies f(X) + f(Y ) ≥ f(X ∪ Y ) + f(X ∩ Y ), ∀X, Y ⊆ V. Submodular functions are discrete analogues of convex functions. They arise in various branches of applied mathematics such as game theory, information theory, and queueing theory. Examples include the matroid rank functions, the cut capacity functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 80 شماره
صفحات -
تاریخ انتشار 2000